منابع مشابه
Block Algorithms for Orthogonal Symplectic Factorizations
On the basis of a new WY -like representation block algorithms for orthogonal symplectic matrix factorizations are presented. Special emphasis is placed on symplectic QR and URV factorizations. The block variants mainly use level 3 (matrix-matrix) operations that permit data reuse in the higher levels of a memory hierarchy. Timing results show that our new algorithms outperform standard algorit...
متن کاملThe split integration symplectic method.
r 0 H H H + = where 0 H is the pure harmonic part and r H is the remaining part. This splitting, incorporated in the second order generalized leapfrog scheme, gives the following approximation for the solution operator of the Hamiltonian system ( ) ( ) ( ) 0 0 r 0 0 t H 2 t H H 2 t t t | x L exp L t exp L exp | x r r ∆ ∆ ∆ + ∆ ≈ which prescribes how to propagate from one point in the phase spac...
متن کاملA symplectic integration method for elastic filaments.
A new method is proposed for integrating the equations of motion of an elastic filament. In the standard finite-difference and finite-element formulations the continuum equations of motion are discretized in space and time, but it is then difficult to ensure that the Hamiltonian structure of the exact equations is preserved. Here we discretize the Hamiltonian itself, expressed as a line integra...
متن کاملLocal Physical Coordinates from Symplectic Projector Method
The basic arguments underlying the symplectic projector method are presented. By this method, local free coordinates on the constraint surface can be obtained for a broader class of constrained systems. Some interesting examples are analyzed.
متن کاملExtended Applicability of the Symplectic Pontryagin Method
Abstract. The Symplectic Pontryagin method was introduced in a previous paper. This work shows that this method is applicable under less restrictive assumptions. Existence of solutions to the Symplectic Pontryagin scheme are shown to exist without the previous assumption on a bounded gradient of the discrete dual variable. The convergence proof uses the representation of solutions to a Hamilton...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ANZIAM Journal
سال: 2016
ISSN: 1445-8810
DOI: 10.21914/anziamj.v56i0.9380